A Brief Survey of Self-Dual Codes
نویسندگان
چکیده
This report is a survey of self-dual binary codes. We present the fundamental MacWilliams identity and Gleason’s theorem on self-dual binary codes. We also examine the upper bound of minimum weights of self-dual binary codes using the extremal weight enumerator formula. We describe the shadow code of a self-dual code and the restrictions of the weight enumerator of the shadow code. Then using the restrictions, we calculate the weight enumerators of self-dual codes of length 38 and 40 and we obtain the known weight enumerators of this lengths. Finally, we investigate the Gaborit-Otmani experimental construction of selfdual binary codes. This construction involves a fixed orthogonal matrix, and we compare the result to the results obtained using other orthogonal matrices.
منابع مشابه
Validity of self-reported hypertension in Mashhad population: brief report
Background: Researchers and health specialists are increasingly obtaining information on chronic illnesses from self-reports. This study validates self-reports of hypertension, based on a recently fielded survey in Mashhad City, Iran. Methods: In this cross-sectional study, we used the results of 2015 census in Mashhad City, a population based survey of people over the age of 30 (n=300745) to ...
متن کاملSelf-Dual Codes
A survey of self-dual codes, written for the Handbook of Coding Theory. Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this chapter include codes over
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملOn the automorphism groups of binary linear codes
Let C be a binary linear code and suppose that its automorphism group contains a non trivial subgroup G. What can we say about C knowing G? In this paper we collect some answers to this question in the cases G ∼= Cp, G ∼= C2p and G ∼= D2p (p an odd prime), with a particular regard to the case in which C is self-dual. Furthermore we generalize some methods used in other papers on this subject. F...
متن کاملNew MDS or near MDS self-dual codes over finite fields
The study of MDS self-dual codes has attracted lots of attention in recent years. There are many papers on determining existence of q−ary MDS self-dual codes for various lengths. There are not existence of q−ary MDS self-dual codes of some lengths, even these lengths < q. We generalize MDS Euclidean self-dual codes to near MDS Euclidean self-dual codes and near MDS isodual codes. And we obtain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009